A note on Helly-B1-EPG graphs
نویسندگان
چکیده
منابع مشابه
On Independent Set on B1-EPG Graphs
In this paper we consider the Maximum Independent Set problem (MIS) on B1-EPG graphs. EPG (for Edge intersection graphs of Paths on a Grid) was introduced in [9] as the class of graphs whose vertices can be represented as simple paths on a rectangular grid so that two vertices are adjacent if and only if the corresponding paths share at least one edge of the underlying grid. The restricted clas...
متن کاملClique coloring B1-EPG graphs
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In this paper we prove that B1-EPG graphs (edge intersection graphs of paths on a grid, where each path has at most one bend) are 4-clique colorable. Moreover, given a B1-EPG repres...
متن کاملApproximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs
A graph G is called Bk-VPG (resp., Bk-EPG), for some constant k ≥ 0, if it has a string representation on a grid such that each vertex is an orthogonal path with at most k bends and two vertices are adjacent in G if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a Bk-VPG graph intersect exactly once, th...
متن کاملA note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملA Note on Smaller Fractional Helly Numbers
Let F be a family of geometric objects in R such that the complexity (number of faces of all dimensions on the boundary) of the union of any m of them is o(m). We show that F , as well as {F ∩P | F ∈ F} for any given set P ∈ R, have fractional Helly number at most k. This improves the known bounds for fractional Helly numbers of many families.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Matemática Contemporânea
سال: 2022
ISSN: ['0103-9059', '2317-6636']
DOI: https://doi.org/10.21711/231766362021/rmc483